Simulation Logic, Applets and Compositional Verification
نویسندگان
چکیده
We present a ompositional veri ation method for ontrol ow based safety properties of smart ard applets. Our method rests on a lose orresponden e between transition system models ordered by simulation and Hennessy-Milner logi extended with simultaneous greatest xed points. We show that simulation an be hara terised logi ally and, vi e versa, logi al satisfa tion an be represented behaviourally by a maximal model for a given formula. Based on these results and earlier ideas by Grumberg and Long we develop a ompositional veri ation te hnique, where maximal models repla e logi al assumptions to redu e ompositional veri ation to standard model he king. However, in the ontext of applets, equipped with interfa es, this te hnique needs to be re ned. Sin e for a given behavioural formula and interfa e a maximal applet does not always exist, we propose a two-level approa h, where lo al assumptions restri t the ontrol ow stru ture of applets, while the global property restri ts the ontrol ow behaviour of the system. By separating the tasks of verifying global and lo al properties of applets, our method supports se ure post-issuan e loading of new applets onto a smart ard.
منابع مشابه
Checking Absence of Illicit Applet Interactions: A Case Study
This paper presents the use of a method – and its corresponding tool set – for compositional verification of applet interactions on a realistic industrial smart card case study. The case study, an electronic purse, is provided by smart card producer Gemplus as a test case for formal methods for smart cards. The verification method focuses on the possible interactions between different applets, ...
متن کاملCompositional Verification of Multi-Agent Systems in Temporal Multi-Epistemic Logic
Compositional verification aims at managing the complexity of the verification process by exploiting compositionality of the system architecture. In this paper we explore the use of a temporal epistemic logic to formalize the process of verification of compositional multi-agent systems. The specification of a system, its properties and their proofs are of a compositional nature, and are formali...
متن کاملCompositional Verification of Knowledge-Based Systems in Temporal Epistemic Logic
It is a recent trend in the literature on verification to study the use of compositionality and abstraction to structure the process of verification; for example, see (Abadi and Lamport, 1993; Hooman, 1994; Dams, Gerth and Kelb, 1996). In (Cornelissen, Jonker and Treur, 1997) a compositional verification method was introduced for logic-based specifications of knowledge-based systems. The curren...
متن کاملFormal Development of Safe and Secure Java Card Applets
This thesis is concerned with formal development of JAVA CARD applets. JAVA CARD is a technology that provides a means to program smart cards with (a subset of) the JAVA language. In recent years JAVA CARD technology gained great interest in the formal verification community. There are two reasons for this. Due to the sensitive nature (e.g., security, maintenance costs) of JAVA CARD applets, fo...
متن کاملCompositional Verification with Stutter-invariant Propositional Projection Temporal Logic
This paper investigates compositional verification with Propositional Projection Temporal Logic (PPTL). To this end, a sublogic Stutter-invariant PPTL (written as PPTLst) is first proposed. As a specification language, PPTLst helps designers get rid of irrelevant detail in compositional verification of a concurrent system since the projection construct of PPTLst allows designers to assert formu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003